Molecular Quantum-D ot C ellular Aut omata
نویسنده
چکیده
Absiract-Quantum-dot cellular automata (QCA) is an approach to computing which eliminates the need for transistors by representing binary digits as charge configurations rather than current levels. Coulomb interactions provide device-device coupling without current flow. Clocked control of the device, allows power gain, control of power dissipation, and pipelined computation. Molecular QCA uses redox sites of molecules as quantum dots. We present an ab initio analysis of a simple molecular system which acts as a clocked molecular QCA cell.
منابع مشابه
O N O-aut Omata
Abst ract . A c -a utomaton is a part icularl y sim ple type of cellu la r automaton on a grap h; each cell is either in stale 0 or 1 and the next sta te of a cell is determined by addi ng the sta tes of it s neighbors modulo two . Using algebraic an d gra ph-theoretic techniques, questions such as reversibility and existe nce of predecessor configura tions of th ese automata will be st udied ....
متن کاملQuantum Chemical Investigations on C14C10-Branched-Chain Glucoside Isomers Towards Understanding Self-Assembly
Density Functional Theory (DFT) calculations have been carried out using a Polarizable Continuum Model (PCM) in an attempt to investigate the electro-molecular properties of branched-chain glucoside (C14C10-D-glucoside) isomers. The results showed that αconfiguration of pyranoside form is thermodynamically the most stable, while the solution should contain much more β...
متن کاملEffect of Noise on Long-term Memory in Cellular Automata with Asynchronous Delays between the Processors
Abst ract. We consider monotonic binary cellular automa ta on the lat tice ZP as models of systems capable of long-term memory, that is, capable of admitting multiple invariant configurat ions. Long-term memory in cellular aut omata can be robust in t he presence of noise, so that in a noisy environment the automaton may admit more than one stationary distribution on configurations. We examine ...
متن کاملOn the Automorphism Group of Integral Circulant Graphs
The integral circulant graph Xn(D) has the vertex set Zn = {0, 1, 2, . . . , n − 1} and vertices a and b are adjacent, if and only if gcd(a − b, n) ∈ D, where D = {d1, d2, . . . , dk} is a set of divisors of n. These graphs play an important role in modeling quantum spin networks supporting the perfect state transfer and also have applications in chemical graph theory. In this paper, we deal wi...
متن کاملAgents in Quantum and Neural Uncertainty
This chapter models quantum and neural uncertainty using a concept of the Agent–based Uncertainty Theory (AUT). The AUT is based on complex fusion of crisp (non-fuzzy) conflicting judgments of agents. It provides a uniform representation and an operational empirical interpretation for several uncertainty theories such as rough set theory, fuzzy sets theory, evidence theory, and probability theo...
متن کامل